A Practical Optimality Condition without Constraint Qualiications for Nonlinear Programming
نویسنده
چکیده
A new optimality condition for minimization with general constraints is introduced. Unlike the KKT conditions, this condition is satissed by local minimizers of nonlinear programming problems, independently of constraint qualiications. The new condition implies, and is strictly stronger than, Fritz-John optimality conditions. Suu-ciency for convex programming is proved.
منابع مشابه
On Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...
متن کاملOn Second-Order Optimality Conditions for Nonlinear Programming
Necessary Optimality Conditions for Nonlinear Programming are discussed in the present research. A new Second-Order condition is given, which depends on a weak constant rank constraint requirement. We show that practical and publicly available algorithms (www.ime.usp.br/∼egbirgin/tango) of Augmented Lagrangian type converge, after slight modifications, to stationary points defined by the new co...
متن کاملA New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constraint qualifications. A new condition of this type is introduced in the present paper. It will be proved that ...
متن کاملSufficient global optimality conditions for general mixed integer nonlinear programming problems
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
متن کاملQuasidiierentiability of Optimal Solutions in Parametric Nonlinear Optimization
Let x 0 be a locally optimal solution of a smooth parametric nonlinear optimization problem minff(x; y) : g(x; y) 0; h(x; y) = 0g for a xed value y = y 0. If the strong suucient optimality condition of second order together with the Mangasarian-Fromowitz and the constant rank constraint qualiications are satissed, then x 0 is strongly stable in the sense of Kojima and the corresponding function...
متن کامل